Finding Low Diameter Low Edge Cost Networks
نویسندگان
چکیده
This paper describes a simulated annealing algorithm to compute k connected graphs that minimize a linear combination of graph edge cost and diameter Repli cas of Internet information services can use graphs with these properties to propagate updates among themselves We report the algorithm s performance on and connected node graphs where edge cost and diame ter correspond to physical distance in a plane For these graphs the algorithm nds solutions whose edge cost and diameter are and lower than our graph construction algorithm that returns feasible but unop timized solutions When optimizing edge cost only the resulting graphs show and reductions edge cost and diameter respectively
منابع مشابه
Upgrading trees under diameter and budget constraints
Given a tree T (V, E) endowed with a length function l and a cost function c, the diameter lowering problem consists in finding the reals 0 ≤ x(e) ≤ l(e), e E such that the tree obtained from T by decreasing the length of every edge e by x(e) units has a minimal diameter subject to the constraint ¥e Ec(e)x(e) ≤ B, where B is the available budget (analogously, one can minimize the cost of loweri...
متن کاملFast Heuristics for Large Instances of the Euclidean Bounded Diameter Minimum Spanning Tree Problem
Given a connected, undirected graph G = (V, E) on n = |V | vertices, an integer bound D ≥ 2 and non-zero edge weights associated with each edge e ∈ E, a bounded diameter minimum spanning tree (BDMST) on G is defined as a spanning tree T⊆ E on G of minimum edge cost w(T) =∑w(e), ∀ e∈ T and tree diameter no greater than D. The Euclidean BDMST Problem aims to find the minimum cost BDMST on graphs ...
متن کاملGreen Heterogeneous Small-Cell Networks Toward reducing the CO2 emissions of mobile communications industry via uplink power control
Heterogeneous small-cell networks (HetSNets) are considered as a standard part of the future mobile networks in which multiple low-power, low-cost user deployed base stations complement the existing macrocell infrastructure. This paper proposes an energy efficient deployment of the small-cells where the small-cell base stations are arranged around the edge of the reference macrocell and the dep...
متن کاملGreen Heterogeneous Small-Cell Networks
Heterogeneous small-cell networks (HetSNets) are considered as a standard part of the future mobile networks in which multiple low-power, low-cost user deployed base stations complement the existing macrocell infrastructure. This paper proposes an energy efficient deployment of the small-cells where the small-cell base stations are arranged around the edge of the reference macrocell and the dep...
متن کاملA Clustering Coefficient Network Formation Game
Social and other networks have been shown empirically to exhibit high edge clustering—that is, the density of local neighborhoods, as measured by the clustering coefficient, is often much larger than the overall edge density of the network. In social networks, a desire for tightknit circles of friendships — the colloquial “social clique” — is often cited as the primary driver of such structure....
متن کامل